Low Density Parity Check Codes
نویسنده
چکیده
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution, a technique used to understand the performance of LDPC codes is illustrated via numerous examples. We also describe how LDPC codes achieve capacity in the Binary Erasure Channel.
منابع مشابه
A Construction for Low Density Parity Check Convolutional Codes Based on Quasi-Cyclic Block Codes
A set of convolutional codes with low density parity check matrices is derived from a class of quasi-cyclic low density parity check block codes. Their performance when decoded using the belief propagation algorithm is investigated.
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملA class of efficient-encoding generalized low-density parity-check codes
In this paper, we investigate an efficient encoding approach for generalized low-density (GLD) parity check codes, a generalization of Gallager’s low-density parity check (LDPC) codes. We propose a systematic approach to construct approximate upper triangular GLD parity check matrix which defines a class of efficientencoding GLD codes. It’s shown that such GLD codes have equally good performanc...
متن کاملParity-Check Matrix Extension to Lower the Error Floors of Irregular LDPC Codes
Trapping sets have been identified as one of the main factors causing error floors of low-density parity-check (LDPC) codes at high SNR values. By adding several new rows to the original parity-check matrix, a novel method is proposed to eliminate small trapping sets in the LDPC code’s Tanner graph. Based on this parity-check matrix extension, we design new codes with low error floors from the ...
متن کاملImproved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation
We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density parity-check codes. For example, for rate 1/4 codes on 16,000 bits over a binary symmetric channel, previous low-density parity-check codes can correct up ...
متن کاملOn Low-Density Parity-Check Convolutional Codes
Abstract – In this paper a formal theory, construction methods, and a random ensemble approach for low-density parity-check convolutional codes (including turbo-codes) are presented. The principles of iterative decoding of low-density parity-check (LDPC) convolutional codes are given, and an iterative algorithm for decoding of homogeneous LDPC convolutional codes is described. Some simulation r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007